Compiling Control Knowledge into Preconditions for Planning in the Situation Calculus
نویسنده
چکیده
A promising technique used in some planning systems to improve their performance is the use of domain dependent search control knowledge. We present a procedure for compiling search control knowledge, expressed declaratively in a logic, into the preconditions of the plan actions (operators). We do this within the framework of the situation calculus by introducing a transformation of nonMarkovian action theories into classical Markovian situation calculus theories.
منابع مشابه
ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond
ConGolog is a logical programming language for agents that is defined in the situation calculus. ConGolog agent control programs were originally proposed as an alternative to planning, but have also more recently been proposed as a means of providing domain control knowledge for planning. In this paper, we present a compiler that takes a ConGolog program and produces a new basic action theory o...
متن کاملConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories
ConGolog is a logical programming language for agents that is defined in the situation calculus. ConGolog agent control programs were originally proposed as an alternative to planning, but have also more recently been proposed as a means of providing domain control knowledge for planning. In this paper, we present a compiler that takes a ConGolog program and produces a new basic action theory o...
متن کاملPrecondition Control and the Progression Algorithm
We consider the problem of planning with declarative search control in the framework of the situation calculus. In particular, we are concerned with forwardchaining planning with search control expressed by linear temporal logic formulas in the style of Bacchus & Kabanza’s TLPlan system. We introduce a procedure for extracting conditions which can then be evaluated on plan prefixes for enforcin...
متن کاملHierarchical Task Libraries in (Con) Golog
We are interested in building libraries of complex actions, or tasks, in the Situation Calculus based languages Golog and its variants. We consider simple ways of organizing tasks in a hierarchical fashion by defining generalized tasks from specialized ones. We use a military operations planning domain to illustrate these ideas.
متن کاملOpen World Planning in the Situation Calculus
We describe a forward reasoning planner for open worlds that uses domain specific information for pruning its search space, as suggested by (Bacchus & Kabanza 1996; 2000). The planner is written in the situation calculus-based programming language GOLOG, and it uses a situation calculus axiomatization of the application domain. Given a sentence to prove, the planner regresses it to an equivalen...
متن کامل